Finite but Unbounded Delay in Synchronous Ccs
نویسنده
چکیده
Extended Abstract ABSTRACT We recast Milner's work on nite delay in synchronous CCS by giving a denota-tional semantics for admissibility of innnite computations on a biinite domain K. Using Abramsky's SFP domain D for bisimulation we obtain a fully abstract model D K for an operational preorder which generalizes Milner's fortiica-tion and whose restriction to nite behavior corresponds to Abramsky's nitary preorder. The biiniteness of D K renders a program logic by considering its Stone dual.
منابع مشابه
Linear matrix inequality approach for synchronization of chaotic fuzzy cellular neural networks with discrete and unbounded distributed delays based on sampled-data control
In this paper, linear matrix inequality (LMI) approach for synchronization of chaotic fuzzy cellular neural networks (FCNNs) with discrete and unbounded distributed delays based on sampled-data controlis investigated. Lyapunov-Krasovskii functional combining with the input delay approach as well as the free-weighting matrix approach are employed to derive several sufficient criteria in terms of...
متن کاملAxisymmetric Scaled Boundary Finite Element Formulation for Wave Propagation in Unbounded Layered Media
Wave propagation in unbounded layered media with a new formulation of Axisymmetric Scaled Boundary Finite Element Method (AXI-SBFEM) is derived. Dividing the general three-dimensional unbounded domain into a number of independent two-dimensional ones, the problem could be solved by a significant reduction in required storage and computational time. The equations of the corresponding Axisymmetri...
متن کاملConcurrent Constraint Automata
We address the problem of the speciication and the proof of properties of concurrent systems which manipulate an unbounded number of data. We propose an approach based on an extended notion of automata, called \Concurrent Constraint Automata (CCA)". A CCA is an automaton with constraints and synchronous communication. By automata with constraints, we mean a state machine whose actions and state...
متن کاملUnbounded Lookahead in WMSO+U Games
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent’s moves. We consider delay games with winning conditions expressed in weak monadic second order logic with the unbounding quantifier (WMSO+U), which is able to express (un)boundedness properties. It is decidable whether the delaying player is able to win such a gam...
متن کاملOn the Expressive Power of Restriction in CCS with Replication
Busi et al [8] showed that CCS! (CCS with replication instead of recursion) is Turing powerful by providing an encoding of Random Access Machines (RAMs) which preserves and reflects convergence (i.e., the existence of terminating computations). The encoding uses an unbounded number of restrictions arising from having restriction operators under the scope of replication. We study the expressive ...
متن کامل